Linearly many faults in dual-cube-like networks
نویسندگان
چکیده
منابع مشابه
Linearly many faults in 2-tree-generated networks
In this article we consider a class of Cayley graphs that are generatedby certain 3-cycles on the alternatinggroup An . These graphs are generalizations of the alternating group graph AGn . We look at the case when the 3-cycles form a “tree-like structure,” and analyze its fault resiliency. We present a number of structural theorems and prove that even with linearly many vertices deleted, the r...
متن کاملLinearly many faults in Cayley graphs generated by transposition trees
In the design of parallel computing, the first step is to decide how processors are linked. A static interconnection network has point-to-point communication links among the processors. For example, they can be used for message-passing architectures. The n-cubes were the first major class of interconnection networks. However, they have some deficiencies and [1] provided the class of star graphs...
متن کاملFault-tolerant cycle embedding in dual-cube with node faults
A low-degree dual-cube was proposed as an alternative to the hypercubes. A dual-cube DC(m) has m + 1 links per node, where m is the degree of a cluster (m-cube) and one more link is used for connecting to a node in another cluster. There are 2 clusters and hence the total number of nodes in a DC(m) is 2 + . In this paper, by using Gray code, we show that there exists a fault-free cycle containi...
متن کاملBroadcasting with linearly bounded transmission faults
We consider broadcasting with a linearly bounded number of transmission failures. For a constant parameter 0 < < 1 we assume that at most i faulty transmissions can occur during the rst i time units of the communication process, for every natural number i. Every informed node can transmit information to at most one neighbor in a unit of time. Faulty transmissions have no eeect. We investigate w...
متن کاملEfficient broadcasting with linearly bounded faults I*,
We consider the problem of broadcasting in the presence of linearly bounded number of transient faults. For some fixed 0 <IX < 1 we assume that at most zi faulty transmissions can occur during the first i time units of the broadcasting algorithm execution, for every natural i. In a unit of time every node can communicate with at most one neighbor. We prove that some bounded degree networks are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.12.009